A Software System for Computing Labeled Orthogonal Drawings of Graphs

A Software System for Computing Labeled Orthogonal Drawings of Graphs

The paper presents a software system for computing orthogonal drawings of graphs with labels on vertices and edges, while minimizing the area or the total edge length of the drawing. The system is thought mainly to support CASE tools in the automatic visualization of diagrams like UML diagrams and ER-diagrams.

Computing Labeled Orthogonal Drawings

This paper studies the problem of computing labeled orthogonal drawings. A label is modeled as arectangle of prescribed size and it can be associated with either a vertex or an edge. Several additionaloptimization goals are taken into account. Namely, the labeled drawing can be required to have eitherminimum total edge length, or minimum width, or minimum height, or minimum area...

Minimum-Change Drawings for Labeled Graphs∗

The interest in algorithms that automate the process of information visualization by the usage of textual labels for features of interest within a visualization has increased with the advance in type-setting technology and the amount of information to be visualized. In this paper, we study minimum-change drawings for labeled graphs, adopting the boundary labeling model [6]. Changes within the g...

Optimal Orthogonal Drawings of Connected Plane Graphs

Improved Orthogonal Drawings of 3-graphs